0.11/0.15	% Problem    : Vampire---4.8_21871 : TPTP v0.0.0. Released v0.0.0.
0.11/0.16	% Command    : run_E %s %d THM
0.16/0.37	% Computer : n012.cluster.edu
0.16/0.37	% Model    : x86_64 x86_64
0.16/0.37	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.16/0.37	% Memory   : 8042.1875MB
0.16/0.37	% OS       : Linux 3.10.0-693.el7.x86_64
0.16/0.37	% CPULimit   : 1440
0.16/0.37	% WCLimit    : 180
0.16/0.37	% DateTime   : Mon Jul  3 12:47:07 EDT 2023
0.16/0.37	% CPUTime    : 
0.22/0.54	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.wohu4qsGjo/Vampire---4.8_21871
0.22/0.54	# Version: 3.1pre001-ho
0.49/0.66	# Preprocessing class: HSLMSMSSLLLCHSA.
0.49/0.66	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.49/0.66	# Starting lpo1_fix with 540s (3) cores
0.49/0.66	# Starting full_lambda_9 with 180s (1) cores
0.49/0.66	# Starting almost_fo_4 with 180s (1) cores
0.49/0.66	# Starting new_ho_9 with 180s (1) cores
0.49/0.66	# Starting pre_casc_4 with 180s (1) cores
0.49/0.66	# Starting ho_unfolding_6 with 180s (1) cores
0.49/0.66	# full_lambda_9 with pid 22050 completed with status 0
0.49/0.66	# Result found by full_lambda_9
0.49/0.66	# Preprocessing class: HSLMSMSSLLLCHSA.
0.49/0.66	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.49/0.66	# Starting lpo1_fix with 540s (3) cores
0.49/0.66	# Starting full_lambda_9 with 180s (1) cores
0.49/0.66	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.49/0.66	# Search class: HGHSM-FSLM32-DHSMMSBN
0.49/0.66	# partial match(1): HGHSM-FSLM32-MHSMMSBN
0.49/0.66	# Scheduled 12 strats onto 1 cores with 180 seconds (180 total)
0.49/0.66	# Starting full_lambda_5 with 15s (1) cores
0.49/0.66	# full_lambda_5 with pid 22056 completed with status 0
0.49/0.66	# Result found by full_lambda_5
0.49/0.66	# Preprocessing class: HSLMSMSSLLLCHSA.
0.49/0.66	# Scheduled 6 strats onto 8 cores with 180 seconds (1440 total)
0.49/0.66	# Starting lpo1_fix with 540s (3) cores
0.49/0.66	# Starting full_lambda_9 with 180s (1) cores
0.49/0.66	# SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
0.49/0.66	# Search class: HGHSM-FSLM32-DHSMMSBN
0.49/0.66	# partial match(1): HGHSM-FSLM32-MHSMMSBN
0.49/0.66	# Scheduled 12 strats onto 1 cores with 180 seconds (180 total)
0.49/0.66	# Starting full_lambda_5 with 15s (1) cores
0.49/0.66	# Preprocessing time       : 0.005 s
0.49/0.66	# Presaturation interreduction done
0.49/0.66	
0.49/0.66	# Proof found!
0.49/0.66	# SZS status Theorem
0.49/0.66	# SZS output start CNFRefutation
0.49/0.66	thf(decl_22, type, is_of: $i > ($i > $o) > $o).
0.49/0.66	thf(decl_23, type, all_of: ($i > $o) > ($i > $o) > $o).
0.49/0.66	thf(decl_25, type, in: $i > $i > $o).
0.49/0.66	thf(decl_77, type, e_is: $i > $i > $i > $o).
0.49/0.66	thf(decl_123, type, nat: $i).
0.49/0.66	thf(decl_124, type, n_is: $i > $i > $o).
0.49/0.66	thf(decl_142, type, n_pl: $i > $i > $i).
0.49/0.66	thf(decl_155, type, esk1_0: $i).
0.49/0.66	thf(decl_156, type, esk2_0: $i).
0.49/0.66	thf(decl_157, type, esk3_0: $i).
0.49/0.66	thf(decl_173, type, epred8_2: $i > $i > $i > $o).
0.49/0.66	thf(def_e_is, axiom, ((e_is)=(^[X1:$i, X60:$i, X61:$i]:(((X60)=(X61))))), file('/export/starexec/sandbox/tmp/tmp.wohu4qsGjo/Vampire---4.8_21871', def_e_is)).
0.49/0.66	thf(def_all_of, axiom, ((all_of)=(^[X3:$i > $o, X2:$i > $o]:(![X4:$i]:(((is_of @ X4 @ X3)=>(X2 @ X4)))))), file('/export/starexec/sandbox/tmp/tmp.wohu4qsGjo/Vampire---4.8_21871', def_all_of)).
0.49/0.66	thf(def_is_of, axiom, ((is_of)=(^[X1:$i, X2:$i > $o]:((X2 @ X1)))), file('/export/starexec/sandbox/tmp/tmp.wohu4qsGjo/Vampire---4.8_21871', def_is_of)).
0.49/0.66	thf(def_n_is, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), file('/export/starexec/sandbox/tmp/tmp.wohu4qsGjo/Vampire---4.8_21871', def_n_is)).
0.49/0.66	thf(satz6, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X280:$i]:((in @ X280 @ nat))) @ (^[X281:$i]:((n_is @ (n_pl @ X1 @ X281) @ (n_pl @ X281 @ X1)))))))), file('/export/starexec/sandbox/tmp/tmp.wohu4qsGjo/Vampire---4.8_21871', satz6)).
0.49/0.66	thf(satz20b, conjecture, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X278:$i]:((in @ X278 @ nat))) @ (^[X279:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((n_is @ X1 @ X279)<=(n_is @ (n_pl @ X1 @ X4) @ (n_pl @ X279 @ X4)))))))))))), file('/export/starexec/sandbox/tmp/tmp.wohu4qsGjo/Vampire---4.8_21871', satz20b)).
0.49/0.66	thf(satz8a, axiom, (all_of @ (^[X1:$i]:((in @ X1 @ nat))) @ (^[X1:$i]:((all_of @ (^[X223:$i]:((in @ X223 @ nat))) @ (^[X224:$i]:((all_of @ (^[X4:$i]:((in @ X4 @ nat))) @ (^[X4:$i]:(((n_is @ X224 @ X4)<=(n_is @ (n_pl @ X1 @ X224) @ (n_pl @ X1 @ X4)))))))))))), file('/export/starexec/sandbox/tmp/tmp.wohu4qsGjo/Vampire---4.8_21871', satz8a)).
0.49/0.66	thf(c_0_7, plain, ((e_is)=(^[Z0/* 19 */:$i, Z1:$i, Z2:$i]:(((Z1)=(Z2))))), inference(fof_simplification,[status(thm)],[def_e_is])).
0.49/0.66	thf(c_0_8, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(fof_simplification,[status(thm)],[def_all_of])).
0.49/0.66	thf(c_0_9, plain, ((is_of)=(^[Z0/* 19 */:$i, Z1:$i > $o]:((Z1 @ Z0)))), inference(fof_simplification,[status(thm)],[def_is_of])).
0.49/0.66	thf(c_0_10, axiom, ((n_is)=(^[Z0/* 19 */:$i, Z1:$i]:(((Z0)=(Z1))))), inference(apply_def,[status(thm)],[def_n_is, c_0_7])).
0.49/0.66	thf(c_0_11, plain, ((all_of)=(^[Z0/* 19 */:$i > $o, Z1:$i > $o]:(![X4:$i]:((((Z0 @ X4))=>(Z1 @ X4)))))), inference(apply_def,[status(thm)],[c_0_8, c_0_9])).
0.49/0.66	thf(c_0_12, plain, ![X842:$i, X843:$i, X844:$i]:(((~(epred8_2 @ X844 @ X843 @ X842)|((X843)=(n_pl @ X844 @ X842)))&(((X843)!=(n_pl @ X844 @ X842))|(epred8_2 @ X844 @ X843 @ X842)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[])])).
0.49/0.66	thf(c_0_13, plain, ![X389:$i]:(((in @ X389 @ nat)=>![X388:$i]:(((in @ X388 @ nat)=>((n_pl @ X389 @ X388)=(n_pl @ X388 @ X389)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz6]), c_0_10]), c_0_11])).
0.49/0.66	thf(c_0_14, plain, ![X1:$i, X4:$i, X5:$i]:(((epred8_2 @ X4 @ X1 @ X5)|((X1)!=(n_pl @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.49/0.66	thf(c_0_15, plain, ![X549:$i, X550:$i]:((~(in @ X549 @ nat)|(~(in @ X550 @ nat)|((n_pl @ X549 @ X550)=(n_pl @ X550 @ X549))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
0.49/0.66	thf(c_0_16, negated_conjecture, ~(![X368:$i]:(((in @ X368 @ nat)=>![X367:$i]:(((in @ X367 @ nat)=>![X366:$i]:(((in @ X366 @ nat)=>(((n_pl @ X368 @ X366)=(n_pl @ X367 @ X366))=>((X368)=(X367)))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz20b])]), c_0_10]), c_0_11])])).
0.49/0.66	thf(c_0_17, plain, ![X1:$i, X4:$i]:((epred8_2 @ X1 @ (n_pl @ X1 @ X4) @ X4)), inference(er,[status(thm)],[c_0_14])).
0.49/0.66	thf(c_0_18, plain, ![X1:$i, X4:$i]:((((n_pl @ X1 @ X4)=(n_pl @ X4 @ X1))|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.49/0.66	thf(c_0_19, negated_conjecture, ((in @ esk1_0 @ nat)&((in @ esk2_0 @ nat)&((in @ esk3_0 @ nat)&(((n_pl @ esk1_0 @ esk3_0)=(n_pl @ esk2_0 @ esk3_0))&((esk1_0)!=(esk2_0)))))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])).
0.49/0.66	thf(c_0_20, plain, ![X378:$i]:(((in @ X378 @ nat)=>![X377:$i]:(((in @ X377 @ nat)=>![X376:$i]:(((in @ X376 @ nat)=>(((n_pl @ X378 @ X377)=(n_pl @ X378 @ X376))=>((X377)=(X376))))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[satz8a]), c_0_10]), c_0_11])])).
0.49/0.66	thf(c_0_21, plain, ![X1:$i, X4:$i]:(((epred8_2 @ X1 @ (n_pl @ X4 @ X1) @ X4)|~((in @ X1 @ nat))|~((in @ X4 @ nat)))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.49/0.66	thf(c_0_22, negated_conjecture, ((n_pl @ esk1_0 @ esk3_0)=(n_pl @ esk2_0 @ esk3_0)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.49/0.66	thf(c_0_23, negated_conjecture, (in @ esk3_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_19])).
0.49/0.66	thf(c_0_24, negated_conjecture, (in @ esk2_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_19])).
0.49/0.66	thf(c_0_25, plain, ![X537:$i, X538:$i, X539:$i]:((~(in @ X537 @ nat)|(~(in @ X538 @ nat)|(~(in @ X539 @ nat)|(((n_pl @ X537 @ X538)!=(n_pl @ X537 @ X539))|((X538)=(X539))))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])).
0.49/0.66	thf(c_0_26, plain, ![X1:$i, X4:$i, X5:$i]:((((X4)=(n_pl @ X1 @ X5))|~((epred8_2 @ X1 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_12])).
0.49/0.66	thf(c_0_27, negated_conjecture, (epred8_2 @ esk3_0 @ (n_pl @ esk1_0 @ esk3_0) @ esk2_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_23]), c_0_24])])).
0.49/0.66	thf(c_0_28, plain, ![X1:$i, X4:$i, X5:$i]:((((X4)=(X5))|~((in @ X1 @ nat))|~((in @ X4 @ nat))|~((in @ X5 @ nat))|((n_pl @ X1 @ X4)!=(n_pl @ X1 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_25])).
0.49/0.66	thf(c_0_29, plain, ((n_pl @ esk3_0 @ esk2_0)=(n_pl @ esk1_0 @ esk3_0)), inference(spm,[status(thm)],[c_0_26, c_0_27])).
0.49/0.66	thf(c_0_30, plain, ![X1:$i]:((((esk2_0)=(X1))|((n_pl @ esk3_0 @ X1)!=(n_pl @ esk1_0 @ esk3_0))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28, c_0_29]), c_0_24]), c_0_23])])).
0.49/0.66	thf(c_0_31, plain, ![X1:$i]:((((esk2_0)=(X1))|((n_pl @ X1 @ esk3_0)!=(n_pl @ esk1_0 @ esk3_0))|~((in @ X1 @ nat)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_18]), c_0_23])])).
0.49/0.66	thf(c_0_32, negated_conjecture, (in @ esk1_0 @ nat), inference(split_conjunct,[status(thm)],[c_0_19])).
0.49/0.66	thf(c_0_33, negated_conjecture, ((esk1_0)!=(esk2_0)), inference(split_conjunct,[status(thm)],[c_0_19])).
0.49/0.66	thf(c_0_34, plain, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_31]), c_0_32])]), c_0_33]), ['proof']).
0.49/0.66	# SZS output end CNFRefutation
0.49/0.66	# Parsed axioms                        : 384
0.49/0.66	# Removed by relevancy pruning/SinE    : 264
0.49/0.66	# Initial clauses                      : 212
0.49/0.66	# Removed in clause preprocessing      : 58
0.49/0.66	# Initial clauses in saturation        : 154
0.49/0.66	# Processed clauses                    : 650
0.49/0.66	# ...of these trivial                  : 5
0.49/0.66	# ...subsumed                          : 234
0.49/0.66	# ...remaining for further processing  : 411
0.49/0.66	# Other redundant clauses eliminated   : 20
0.49/0.66	# Clauses deleted for lack of memory   : 0
0.49/0.66	# Backward-subsumed                    : 7
0.49/0.66	# Backward-rewritten                   : 39
0.49/0.66	# Generated clauses                    : 1728
0.49/0.66	# ...of the previous two non-redundant : 1707
0.49/0.66	# ...aggressively subsumed             : 0
0.49/0.66	# Contextual simplify-reflections      : 0
0.49/0.66	# Paramodulations                      : 1576
0.49/0.66	# Factorizations                       : 2
0.49/0.66	# NegExts                              : 0
0.49/0.66	# Equation resolutions                 : 26
0.49/0.66	# Total rewrite steps                  : 819
0.49/0.66	# Propositional unsat checks           : 0
0.49/0.66	#    Propositional check models        : 0
0.49/0.66	#    Propositional check unsatisfiable : 0
0.49/0.66	#    Propositional clauses             : 0
0.49/0.67	#    Propositional clauses after purity: 0
0.49/0.67	#    Propositional unsat core size     : 0
0.49/0.67	#    Propositional preprocessing time  : 0.000
0.49/0.67	#    Propositional encoding time       : 0.000
0.49/0.67	#    Propositional solver time         : 0.000
0.49/0.67	#    Success case prop preproc time    : 0.000
0.49/0.67	#    Success case prop encoding time   : 0.000
0.49/0.67	#    Success case prop solver time     : 0.000
0.49/0.67	# Current number of processed clauses  : 248
0.49/0.67	#    Positive orientable unit clauses  : 43
0.49/0.67	#    Positive unorientable unit clauses: 0
0.49/0.67	#    Negative unit clauses             : 55
0.49/0.67	#    Non-unit-clauses                  : 150
0.49/0.67	# Current number of unprocessed clauses: 1250
0.49/0.67	# ...number of literals in the above   : 4598
0.49/0.67	# Current number of archived formulas  : 0
0.49/0.67	# Current number of archived clauses   : 151
0.49/0.67	# Clause-clause subsumption calls (NU) : 6575
0.49/0.67	# Rec. Clause-clause subsumption calls : 2570
0.49/0.67	# Non-unit clause-clause subsumptions  : 150
0.49/0.67	# Unit Clause-clause subsumption calls : 971
0.49/0.67	# Rewrite failures with RHS unbound    : 0
0.49/0.67	# BW rewrite match attempts            : 21
0.49/0.67	# BW rewrite match successes           : 11
0.49/0.67	# Condensation attempts                : 0
0.49/0.67	# Condensation successes               : 0
0.49/0.67	# Termbank termtop insertions          : 70470
0.49/0.67	
0.49/0.67	# -------------------------------------------------
0.49/0.67	# User time                : 0.102 s
0.49/0.67	# System time              : 0.015 s
0.49/0.67	# Total time               : 0.117 s
0.49/0.67	# Maximum resident set size: 4500 pages
0.49/0.68	
0.49/0.68	# -------------------------------------------------
0.49/0.68	# User time                : 0.111 s
0.49/0.68	# System time              : 0.018 s
0.49/0.68	# Total time               : 0.129 s
0.49/0.68	# Maximum resident set size: 2336 pages
0.49/0.68	% E---3.1 exiting
0.49/0.68	EOF